Formal Model and Analysis of Usage Control

نویسندگان

  • Xinwen Zhang
  • Larry Kerschberg
  • Kris Gaj
  • Daniel A. Menascé
چکیده

FORMAL MODEL AND ANALYSIS OF USAGE CONTROL Xinwen Zhang, Ph.D. George Mason University, 2006 Dissertation Director: Ravi S. Sandhu Dissertation Co-director: Francesco Parisi-Presicce The concept of usage control (UCON) was introduced as a unified approach to capturing a number of extensions for access control models and systems. In UCON, a control decision is determined by three aspects: authorizations, obligations and conditions. Attribute mutability and decision continuity are two distinct characteristics which are presented in UCON for the first time. In this research I develop a logical model beyond the conceptual UCON model to capture the formal semantics of these key features, and then analyze the expressive power and safety properties of UCON. Although the informal study of policy specification flexibility with UCON has been conducted in previous work, the multiple control components and unique features such as decision continuity and attribute mutability have not been formally studied. In this dissertation I develop a logical model of UCON based on an extended version of Lamport’s temporal logical of actions (TLA) to formalize the state transitions in a single usage process. The model consists of predicates on subject and object attributes as authorizations, subject actions as obligations, and predicates on system attributes as conditions. With these basic terms, a usage control policy can be specified by a set of logical formulae, which are instantiated from a fixed set of scheme rules. The policy specification language is shown to be sound and complete. The flexibility of policy specification with UCON is shown by expressing policies for various applications. To formally study the expressive power of UCON by comparing with traditional access control models, a policy-based model is developed to formalize the overall effect of a usage process. With this model, I prove that the general single-object typed access matrix (SO-TAM) model can be simulated with a UCON preA model, which is a sub-model of UCON with only pre-authorizations. The study of the expressive power shows that preA is at least as expressive as the augmented typed access matrix model (ATAM). For the expressive power of UCON pre-obligation models (preB), I prove that a general UCON preA model can be reduced to a preB model, and vice versa. This demonstrates that fundamentally these two models have the same expressive power. For UCON ongoing authorization and obligation models (onA and onB), the system state changes non-deterministically, depending on concurrent accesses and reasons for attribute updates (e.g., ended access vs. revoked access). The study of the expressive power for these models is left for future work. In UCON pre-condition and ongoing condition models (preC and onC), a usage control decision is determined by some environmental restrictions dependant on system attributes. Since UCON core models do not capture how system attributes change, it would be inappropriate to compare the expressive power of UCON condition models with others. Safety is a fundamental problem of access control models. With the policy-based model, I first show that the general UCON preA and preB models have undecidable safety. With some restrictions on the general models, I propose a UCON preA model with decidable safety. The restricted model maintains reasonable expressive power as shown by simulating a role-based access control (RBAC) model with a specific user-role administration scheme, and a digital rights management (DRM) application with consumable rights. The safety analysis of onA, preB, and onB is left for future work. For UCON condition models, since how system attributes change is not captured in UCON, the safety problem is not a valid problem because the system state changes occur by events outside the scope of the control of UCON model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computationally secure multiple secret sharing: models, schemes, and formal security analysis

A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...

متن کامل

Investigating The Effect of Teaching “Philosophy of Formal and Public Education” in Farhangian University within the scaffolding of Leadership and Management Education Model on Students’ Learning and Academic Achievement

The study performed to investigate the effect of teaching the course of Formal and Public Education Philosophy (FPEP) within the scaffolding of Leadership and Management Education Model (LMEM) on university students’ learning and academic achievement at Farhangian University (UT) using quasi-experimental method with two-groups pre-test and post-test design with control group. The statistical po...

متن کامل

Investigating The Effect of Teaching “Philosophy of Formal and Public Education” in Farhangian University within the scaffolding of Leadership and Management Education Model on Students’ Learning and Academic Achievement

The study performed to investigate the effect of teaching the course of Formal and Public Education Philosophy (FPEP) within the scaffolding of Leadership and Management Education Model (LMEM) on university students’ learning and academic achievement at Farhangian University (UT) using quasi-experimental method with two-groups pre-test and post-test design with control group. The statistical po...

متن کامل

Formal Verification of Usage Control Models: A Case Study of UseCON Using TLA+

Usage control models provide an integration of access control, digital rights, and trust management. To achieve this integration, usage control models support additional concepts such as attribute mutability and continuity of decision. However, these concepts may introduce an additional level of complexity to the underlying model, rendering its definition a cumbersome and prone to errors proces...

متن کامل

A model for specification, composition and verification of access control policies and its application to web services

Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...

متن کامل

Reachability checking in complex and concurrent software systems using intelligent search methods

Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006